A note on non-broken-circuit sets and the chromatic polynomial
نویسنده
چکیده
1. Definitions and a main result 2 1.1. Graphs and colorings . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2. Symmetric functions . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3. Chromatic symmetric functions . . . . . . . . . . . . . . . . . . . . . 5 1.4. Connected components . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.5. Circuits and broken circuits . . . . . . . . . . . . . . . . . . . . . . . 6
منابع مشابه
Bijective proofs of two broken circuit theorems
We prove, by means of explicit bijections, theorems of Whitney and Stanley that express the coefficients of the chromatic polynomial of a graph G and the number of acyclic orientations of G in terms of numbers of sets of edges that contain no broken circuits of G. Let G be a graph, and let a total ordering of its edge set E ( G ) be fixed. Words like “first” or “later,” when applied to edges, w...
متن کاملThe Broken - Circuit Complex 1 by Tom
The broken-circuit complex introduced by H. Wilf (Which polynomials are chromatic!, Proc. Colloq. Combinational Theory (Rome, 1973)) of a matroid G is shown to be a cone over a related complex, the reduced broken-circuit complex Q'(G). The topological structure of Q'(G) is studied, its Euler characteristic is computed, and joins and skeletons are shown to exist in the class of all such complexe...
متن کاملA note on a broken-cycle theorem for hypergraphs
Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets. We give a definition of cycles in hypergraphs that preserves the statement of the theorem there.
متن کاملAn Abstraction of Whitney's Broken Circuit Theorem
We establish a broad generalization of Whitney’s broken circuit theorem on the chromatic polynomial of a graph to sums of the type ∑ A⊆S f(A) where S is a finite set and f is a mapping from the power set of S to an abelian group. We give applications to the domination polynomial and the subgraph component polynomial of a graph, the chromatic polynomial of a hypergraph, the characteristic polyno...
متن کاملImproved inclusion-exclusion identities via closure operators
Improved inclusion-exclusion identities via closure operators Klaus Dohmen Department of Computer Science, Humboldt-University Berlin, Unter den Linden 6, D-10099 Berlin, Germany E-mail: [email protected] received March 24, 1999, revised September 6, 1999, accepted April 15, 2000. Let be a finite family of sets. We establish an improved inclusion-exclusion identity for each closure...
متن کامل